Date: Tuesday, 14-Jan-97 23:11:05 GMT
Server: NCSA/1.3
MIME-version: 1.0
Content-type: text/html

<HTML>

<HEAD>

<TITLE>CS 440 Teaching Schedule</TITLE>

</HEAD>

<BODY>

<H2>CS 440 - Foundations of Computing
<P>
Teaching Schedule</H2>
<HR>

August
<BLOCKQUOTE>
28 - Introduction<BR>
</BLOCKQUOTE>
September
<BLOCKQUOTE>
3  - The NICE Programming Language<BR>
5  - Turing Machines<BR>
10 - A Smaller Programming Language<BR>
12 - Equivalence of the Models<BR>
17 - Machine Enhancement, The Theses of Church and Turing<BR>
19 - Arithmetization<BR>
24 - Properties of the Enumeration<BR>
26 - Properties of the Enumeration<BR>
</BLOCKQUOTE>
October
<BLOCKQUOTE>
1  - Universal Machines and Simulation<BR>
3  - Solvability and the Halting Problem<BR>
8  - Reducibility and Unsolvability<BR>
10 - Enumerable and Recursive Sets<BR>
15 - Measures and Resource Bounds<BR>
17 - Complexity Classes, The Classes <i>P</i> and <i>NP</i><BR>
22 - Review<BR>
24 - First Examination<BR>
29 - <i>NP</i>-Completeness<BR>
31 - Intractable Problems<BR>
</BLOCKQUOTE>
November
<BLOCKQUOTE>
7  - Finite Automata, Closure Properties, and Nondeterminism<BR>
12 - Regular Sets and Expressions<BR>
14 - Decision Problems for Finite Automata<BR>
19 - Pushdown Automata<BR>
21 - Unsolvable Problems for Pushdown Automata<BR>
26 - Grammars<BR>
</BLOCKQUOTE>
December
<BLOCKQUOTE>
3  - Language Properties<BR>
5  - Second Examination<BR>
10 - Regular Languages<BR>
12 - Context Free Languages<BR>
</BLOCKQUOTE>

</BODY>

</HTML>
